Counting Words by Number of Occurrences of Some Patterns
نویسندگان
چکیده
We give asymptotic expressions for the number of words containing a given number of occurrences of a pattern for two families of patterns with two parameters each. One is the family of classical patterns in the form 22 · · · 212 · · · 22 and the other is a family of partially ordered patterns. The asymptotic expressions are in terms of the number of solutions to an equation, and for one subfamily this quantity is the number of integer partitions into qth order binomial coefficients.
منابع مشابه
The sigma-sequence and counting occurrences of some patterns, subsequences and subwords
We consider sigma-words, which are words used by Evdokimov in the construction of the sigma-sequence [Evdok]. We then find the number of occurrences of certain patterns and subwords in these words.
متن کاملThe Peano curve and counting occurrences of some patterns
We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in these words.
متن کاملCounting Occurrences of Some Subword Patterns Alexander Burstein and Toufik Mansour
We find generating functions for the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
متن کاملCounting the Occurrences of Generalized Patterns in Words Generated by a Morphism
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are either classical patterns 1-2, 2-1, 1-1· · · -1, or arbitrary generalized patterns without internal dashes, in which repetitions of letters are allowed. In p...
متن کاملCounting ordered patterns in words generated by morphisms I. Rises, descents, and repetitions with gaps
We start a general study of counting the number of occurrences of ordered patterns in words generated by morphisms. The case of rises and descents is considered. We give recurrence formulas in the general case. We deduce exact formulas for a particular family of morphisms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011